Moni Naor

Results: 60



#Item
31

Randomized Algorithms 2015A – Problem Set 2 Robert Krauthgamer and Moni Naor Due: December 30, Analyze the construction below of a stretch 3 distance oracle for a graph G, and show that its storage requirement

Add to Reading List

Source URL: www.wisdom.weizmann.ac.il

- Date: 2014-12-31 19:10:51
    32

    Veri cation of a human in the loop or Identi cation via the Turing Test Moni Naor y

    Add to Reading List

    Source URL: www.wisdom.weizmann.ac.il

    Language: English - Date: 2011-06-02 14:00:47
      33

      Fast Algorithms for Interactive Coding Zvika Brakerski∗ Moni Naor† Abstract

      Add to Reading List

      Source URL: www.wisdom.weizmann.ac.il

      Language: English - Date: 2012-11-12 15:04:54
        34

        Sketching in Adversarial Environments Ilya Mironov∗ Moni Naor† Gil Segev‡

        Add to Reading List

        Source URL: www.wisdom.weizmann.ac.il

        Language: English - Date: 2013-11-13 07:40:01
          35

          Games For Exchanging Information∗ Gillat Kol† Moni Naor§ Abstract

          Add to Reading List

          Source URL: www.wisdom.weizmann.ac.il

          Language: English - Date: 2007-12-25 11:56:02
            36

            Algorithmic Game Theory - handout4 Uriel Feige, Robert Krauthgamer, Moni Naor 26 November 2008 The fourth Israeli Seminar on Computational Game Theory will be held on Wednesday, December 31, 10:00AM – 4:30PM in Microso

            Add to Reading List

            Source URL: www.wisdom.weizmann.ac.il

            Language: English - Date: 2008-11-26 05:25:24
              37

              Basing Cryptographic Protocols on Tamper-Evident Seals Tal Moran∗ Moni Naor∗† Abstract

              Add to Reading List

              Source URL: www.wisdom.weizmann.ac.il

              Language: English - Date: 2008-09-15 04:36:53
                38

                Randomized Algorithms 2013A Lecture 5 – Martingales, Closest Pairs, Hash Tables, Existential Proofs and Codes ∗ Moni Naor The lecture covered quite varied material, starting from Martingales, moving to a linear time

                Add to Reading List

                Source URL: www.wisdom.weizmann.ac.il

                Language: English - Date: 2012-12-06 01:55:15
                  39

                  De-amortized Cuckoo Hashing: Provable Worst-Case Performance and Experimental Results Yuriy Arbitman∗ Moni Naor†

                  Add to Reading List

                  Source URL: www.wisdom.weizmann.ac.il

                  Language: English - Date: 2009-05-03 13:29:04
                    40

                    Algorithmic Game Theory – Handout 6 Uriel Feige, Robert Krauthgamer, Moni Naor December 10, 2008 We consider graphical games with n players where the graph G is a tree of maximum degree d, and each player has 2 possibl

                    Add to Reading List

                    Source URL: www.wisdom.weizmann.ac.il

                    Language: English - Date: 2008-12-12 00:45:07
                      UPDATE